package com.hyb.algorithm.data.struct.dp;

/**
 * @author: ybhu
 * @create: 2021/09/19 22:10
 *
 * 70. 爬楼梯
 * https://leetcode-cn.com/problems/climbing-stairs/
 */
public class ClimbStairs {


    public int climbStairs(int n) {

        int[] dp=new int[n+1];

        //定义动态规划
        dp[0]=1;
        dp[1]=1;

        for(int i=2;i<=n;i++){
            dp[i]=dp[i-1]+dp[i-2];
        }

        return dp[n];

    }
}
